Approximate Nearest Neighbour-based Index Tree: A Case Study for Instrumental Music Search
نویسندگان
چکیده
Abstract Many people are interested in instrumental music. They may have one piece of song, but it is a challenge to seek the song because they do not lyrics describe for text-based search engine. This study leverages Approximate Nearest Neighbours preprocess songs and extract characteristics track repository using Mel frequency cepstral coefficients (MFCC) characteristic extraction. Our method digitizes track, extracts characteristics, builds index tree with different lengths each MFCC dimension number vectors. We collected played various instruments experiments. result on 100 pieces lengths, sampling rate 16000 length 13, gives best results, where accuracy Top 1 36 %, 5 4 10 44 %. expect this work provide useful tools develop digital music e-commerce systems.
منابع مشابه
Realtime Registration-Based Tracking via Approximate Nearest Neighbour Search
We introduce a new 2D visual tracking algorithm that utilizes an approximate nearest neighbour search to estimate per-frame state updates. We experimentally demonstrate that the new algorithm capable of estimating larger per-frame motions than the standard registration-based algorithms and that it is more robust in a vision-controlled robotic alignment task.
متن کاملSome Improvements in Tree Based Nearest Neighbour Search Algorithms
Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70’s. This algorithm uses a tree that is traversed on search time and uses some elimina...
متن کاملSome approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are interested in algorithms that can be used with any dissimilarity function provided that it fits the mathematical notion of distance. Some of such algorithms organize, in preprocessing time, the data in a tree structur...
متن کاملThe Area Code Tree for Approximate Nearest Neighbour Search in Dense Point Sets
In this paper, we present an evaluation of nearest neighbour searching using the Area Code tree. The Area Code tree is a trie-type structure that organizes area code representations of each point of interest (POI) in a data set. This data structure provides a fast method for locating an actual or approximate nearest neighbour POI for a query point. We first summarize the area code generation, i...
متن کاملFast k nearest neighbour search for R-tree family
A simpliied k nearest neighbour (knn) search for the R-tree 6] family is proposed in this paper. This method is modiied from the technique developed by Roussopoulos et al. 10]. The main approach aims to eliminate redundant searches when the data is highly correlated. We also describe how MINMAXDIST calculations can be avoided using MINDIST as the only distance metric which gives a signiicant sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computer Systems
سال: 2023
ISSN: ['2255-8691', '2255-8683']
DOI: https://doi.org/10.2478/acss-2023-0015